A Non-interleaving Timed Process Algebra and a Process Logic for Verifying Composition of Agents
نویسندگان
چکیده
We present formal frameworks tCCA, tLCA, and tICCA for verifying composition of agents. Behaviors of composite agents are described in tCCA and specifications for them are described in tLCA. Since consistency between specifications in tLCA is undecidable as proven in this paper, we propose to use intermediate specifications described in tICCA instead of directly checking the consistency, and then give useful propositions for verifying composition of agents in tICCA.
منابع مشابه
Explicit Substitution: on the Edge of Strong Normalisation
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and AnaJysis ofDynamic Leader Election Protocolsin Broadcast Networks, p. 73. A generaJ conservative extension theorem in process algebra, p. 17.Job Shop Scheduling by Constraint Satisfaction, p. 22. A HierarchicaJ Membership Protocol for SynchronousDistributed Systems, p. 43. Temporal operators viewe...
متن کاملFinite Axiomatization over CCS with Hennessy’s Merge
This note shows that split-2 bisimulation equivalence (also known as timed equivalence) affords a finite equational axiomatization over the process algebra obtained by adding an auxiliary operation proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicating Systems. Thus the addition of a single binary operation, viz. Hennessy’s merge, is sufficient for the...
متن کاملNon-determinism and Probabilities in Timed Concurrent Constraint Programming (Extended Version)
We set the grounds of a framework for modeling and verifying systems involving probabilities, time, and partial information as constraints. A timed concurrent constraint process calculus with probabilistic and non-deterministic choices is proposed as description language. An operational semantics ensures consistent interactions between both kinds of choices. The semantics is also shown to be in...
متن کاملVerifying Performance Equivalence for Timed Basic Parallel Processes
We address the problem of deciding performance equivalence for a timed process algebra in which actions are urgent and durational, and where parallel components have independent local clocks. This process algebra can be seen as a timed extension of BPP, a process algebra giving rise to infinite-state processes. While bisimulation was known to be decidable for BPP with a non elementary complexit...
متن کاملGraph isomorphism models for non interleaving process algebra
Reduction and Topology, p. 28. Non Interleaving Process Algebra, p. 17. Design and Analysis of Dynamic Leader Election Protocols in Broadcast Networks, p. 73. A general conservative extension tbeorem in process algebra, p. 17. Job Shop Scheduling by Constraint Satisfaction, p. 22. A Hierarchical Membership Protocol for Synchronous Distributed Systems, p. 43. Temporal operators viewed as predica...
متن کامل